Solving Ellipsoid-Constrained Integer Least Squares Problems
نویسندگان
چکیده
منابع مشابه
The Randomized Ellipsoid Algorithm for Constrained Robust Least Squares Problems
In this chapter a randomized ellipsoid algorithm is described that can be used for finding solutions to robust Linear Matrix Inequality (LMI) problems. The iterative algorithm enjoys the property that the convergence speed is independent on the number of uncertain parameters. Other advantages, as compared to the deterministic algorithms, are that the uncertain parameters can enter the LMIs in a...
متن کاملColumn Reordering for Box-Constrained Integer Least Squares Problems
The box-constrained integer least squares problem (BILS) arises in MIMO wireless communications applications. Typically a sphere decoding algorithm (a tree search algorithm) is used to solve the problem. In order to make the search algorithm more efficient, the columns of the channel matrix in the BILS problem have to be reordered. To our knowledge, there are currently two algorithms for column...
متن کاملReduction in Solving Some Integer Least Squares Problems
Solving an integer least squares (ILS) problem usually consists of two stages: reduction and search. This thesis is concerned with the reduction process for the ordinary ILS problem and the ellipsoid-constrained ILS problem. For the ordinary ILS problem, we dispel common misconceptions on the reduction stage in the literature and show what is crucial to the efficiency of the search process. The...
متن کاملCombining Discrete Ellipsoid-based Search and Branch-and-Cut for Integer Least Squares Problems
In this paper we perform computational studies on two types of integer least squares (ILS) problems that arise in wireless communication applications: unconstrained and box-constrained ILS problems. We perform extensive experiments comparing the performance of the discrete ellipsoid-based search (DEBS) method and the branch-and-cut (B&C) mixed integer programming (MIP) solver, and identify the ...
متن کاملSolving Rank-Deficient Linear Least-Squares Problems*
Numerical solution of linear least-squares problems is a key computational task in science and engineering. Effective algorithms have been developed for the linear least-squares problems in which the underlying matrices have full rank and are well-conditioned. However, there are few efficient and robust approaches to solving the linear least-squares problems in which the underlying matrices are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2010
ISSN: 0895-4798,1095-7162
DOI: 10.1137/060660680